Cycle covers of cubic multigraphs
نویسندگان
چکیده
Alspach, B. and C.-Q. Zhang, Cycle covers of cubic multigraphs, Discrete Mathematics 111 (1993) 11-17.
منابع مشابه
Quartic Graphs with Every Edge in a Triangle
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from the line multigraphs of cubic multigraphs by a number of simple subgraph-replacement operations. A corollary of this is that a simple quartic graph with every e...
متن کامل1-factor Covers of Regular Graphs
We consider minimal 1-factor covers of regular multigraphs, focusing on those that are 1-factorizations. In particular, we classify cubic graphs such that every minimal 1-factor cover is also a 1-factorization, and also classify simple regular bipartite graphs with this property. For r > 3, we show that there are finitely many simple r-regular graphs such that every minimal 1-factor cover is al...
متن کاملEnumeration of cubic multigraphs on orientable surfaces
Let Sg be the orientable surface of genus g. We show that the number of edgelabelled cubic multigraphs embeddable on Sg with m = 3k edges is asymptotically dgγ −mm5/2(g−1)−1m!, where γ−1 = √ 79 3 2 −1/3 and cg is a constant only dependent on the genus.
متن کاملCycle double covers and spanning minors II
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spanning subgraph isomorphic to a subdivision of a bridgeless cubic graph on at most 10 vertices then G has a CDC. A notable result is thus that a cubic graph with a spanning Petersen minor has a CDC, a result also obtaine...
متن کاملSmall cycle covers of 3-connected cubic graphs
Every 2-connected simple cubic graph of order n ≥ 6 has a cycle cover with at most dn4 e cycles. This bound is best possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 111 شماره
صفحات -
تاریخ انتشار 1993